基于梯形直觉模糊数的动态多准则群决策方法

针对决策信息为梯形直觉模糊数的多准则决策问题,引入含参得分函数和相关系数提出了一种动态多准则群决策方法,首先利用参照方案相关系数总偏差最小的非线性规划模型求解客观准则权重,通过参数因子转化犹豫度集结得到各方案综合得分函数,最后根据参数动态变化进行MATLAB仿真分析并排序。该方法适用于准则权重已知和未知的情形,弥补了犹豫度缺失和基于距离测度决策方法的缺陷,并通过航空装备保障合同商的选择决策实例验证了有效性。     

Robust shortest path planning and semicontractive dynamic programming

In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit‐evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and uniqueness of solution of the optimality equation, existence of optimal paths, and the validity of various algorithms patterned after the classical methods of value and policy iteration, as well as a Dijkstra‐like algorithm for problems with nonnegative arc lengths.© 2016 Wiley Periodicals, Inc. Naval Research Logistics 66:15–37, 2019     

Scheduling policies for an antiterrorist surveillance system

This article concerns scheduling policies in a surveillance system aimed at detecting a terrorist attack in time. Terrorist suspects arriving at a public area are subject to continuous monitoring, while a surveillance team takes their biometric signatures and compares them with records stored in a terrorist database. Because the surveillance team can screen only one terrorist suspect at a time, the team faces a dynamic scheduling problem among the suspects. We build a model consisting of an M/G/1 queue with two types of customers—red and white—to study this problem. Both types of customers are impatient but the reneging time distributions are different. The server only receives a reward by serving a red customer and can use the time a customer has spent in the queue to deduce its likely type. In a few special cases, a simple service rule—such as first‐come‐first‐serve—is optimal. We explain why the problem is in general difficult and we develop a heuristic policy motivated by the fact that terrorist attacks tend to be rare events. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

薄壳变速箱壳体动态响应仿真分析与试验验证

在ADAMS（Automatic Dynamic Analysis of Mechanical Systems）中搭建薄壳箱体的刚柔耦合虚拟仿真模型，进行动态响应仿真分析。在相同试验条件下，搭建薄壳箱体动态响应试验台架，并进行动态振动试验。利用Q-400非接触式测试系统测量台架试验结果。对比仿真分析和试验测量结果，验证了仿真分析模型的准确性和计算结果的可靠性。     

炮射导弹武器动态参数综合测试系统设计

改变传统的炮射导弹武器激光控制和火炮发射系统动态参数的测试模式，基于计算机总线技术、高速图像采集与处理技术以及激光阵元探测技术，设计了炮射导弹武器动态参数综合测试系统。详细介绍了系统的设计方案及其工作原理。该系统在野战条件下可对多种型号炮射导弹的性能进行动态参数测试及评估。     

基于GPU的动态地形过程纹理映射方法

针对基于GPU的动态地形可视化算法中地形形变处的纹理映射问题,提出了在片元着色器里对多种纹理样本进行采样,以动态地形模型本身特点为纹理生成条件,以地形深度偏移图作为动态地形纹理分布alphamap图的动态地形过程纹理生成和映射方法。通过典型的弹坑和车辙纹理映射实验,验证了该方法的正确性和有效性。     

雷达组网系统抗干扰能力动态仿真评估研究

雷达组网抗干扰能力评估是组网系统作战效能评估的一个重要方面，运用仿真模拟法和最优指标法，对组网系统抗干扰能力进行了动态评估研究。基于研究现状的分析，提出了组网系统抗干扰能力的一种评估框架结构；构建了组网系统抗压制性干扰能力的动态评估指标体系，采用最优指标法对4种组网方案在复合压制干扰模式下的抗干扰能力进行了动态仿真分析和方案的优劣评价。评估结果与实际抗干扰试验的结论相符，验证了评估指标体系的有效性和合理性，所得结论对复杂电子战环境下雷达组网系统作战效能研究具有指导意义。     

基于速度障碍的无人机避免机动障碍物问题

针对无人机避免机动障碍物的问题,应用速度障碍法,在充分考虑障碍物可达范围和无人机最大机动能力的基础上,将问题空间转换到了速度空间,然后以速度障碍的边界条件替代速度障碍的整体范围约束,这样得到了速度障碍的简单表达形式。最后结合最优控制,在速度空间解决了无人机避免障碍物的问题,并直接求解出了合适的速度输出。仿真结果表明方法切实可行。     

基于阵列式探测器的舰载高能激光武器动态精度试验方法研究

对高机动目标的跟踪、瞄准精度是舰载高能激光武器系统的重要性能指标之一，也是未来装备状态鉴定和列装定型工作的主要考核项目。以舰载高能激光武器为研究对象，系统分析了其动态精度试验的技术特点，在此基础上，针对其跟踪瞄准精度要求高的实际问题，提出了基于阵列式探测器的试验和数据处理方法，能够有效完成对舰载高能激光武器动态精度的试验与评估。     

基于动态罚函数遗传算法的电磁探测卫星多星规划方法

针对电磁探测卫星的特点,考虑其主要约束条件,建立了多星联合规划数学模型,提出了基于遗传算法的电磁探测卫星多星规划算法.为处理遗传算法迭代过程中产生的不可行解,引入了基于罚函数法的约束处理方法.针对罚函数法中惩罚系数难以确定的特点,设计了惩罚系数自适应调整的动态罚函数机制.根据模拟的数据进行实验及分析,表明该方法能有效解决电磁探测卫星多星规划问题.